Recognizing Abelian Sylow Subgroups in Finite Groups

Let p be a prime. We prove that if a finite group G has non-abelian Sylow p-subgroups, and the class size of every p-element in G is coprime to p, then G contains a simple group as a subquotient which exhibits the same property. In addition, we provide a list of all the simple groups and primes such that the Sylow p-subgroups are non-abelian and all p-elements have class size coprime to p.     

Unique Node Extremal Subgroups in Chevalley Groups

Abstract

Taking G to be a Chevalley group of rank at least 3 and U to be the unipotent radical of a Borel subgroup B,an extremal subgroup A is an abelian normal subgroup of U which is not contained in the intersection of all the unipotent radicals of the rank 1 parabolic subgroups of G containing B. If there is an unique rank 1 parabolic subgroup P of G containing B with the property that A is not contained in the unipotent radical of P,then A is called a unique node extremal subgroup. In this paper we investigate the embedding of unique node extremal subgroups in U and prove that,apart from some specified cases,such a subgroup is contained in the unipotent radical of a certain maximal parabolic subgroup.     

Finite Groups with Few Non-Abelian Subgroups

Let G be a finite group and τ(G) denote the number of conjugacy classes of all non-abelian subgroups of G. The symbol π(G) denotes the set of the prime divisors of |G|. In this paper, finite groups with τ(G) ≤ |π(G)| are classified completely. Furthermore, finite nonsolvable groups with τ(G) = |π(G)| +1 are determined.     

Classification of Groups Which Admit a Finite Number of Distinct Right-Orders

Tararin has shown that a non-Abelian group G admits a nonzero finite number of distinct right-orders if and only if G is equipped with a Tararin-type series of some length n. Further, a group which has a Tararin-type series of length n admits 2 ⁿ right-orders. It is known that a group has two right-orders if and only if it is torsionfree Abelian of rank 1. Here we completely classify the groups which admit either four or eight right-orders.     

A note on the commutativity of groups

In this article, we show that a group is abelian if and only if every two elements of the same order commute.     

Walker's Cancellation Theorem

Walker's cancellation theorem says that, if B ⊕ Z is isomorphic to C ⊕ Z in the category of abelian groups, then B is isomorphic to C. We construct an example in a diagram category of abelian groups where the theorem fails. As a consequence, the original theorem does not have a constructive proof even if B and C are subgroups of the free abelian group on two generators. Both of these results contrast with a group whose endomorphism ring has stable range one, which allows a constructive proof of cancellation and also a proof in any diagram category.     

On the Dimensions of Commutative Subalgebras and Subgroups of Nilpotent Algebras and Lie Groups of Class 2

We obtain the functions that bound the dimensions of finite dimensional nilpotent associative or Lie algebras of class 2 over an algebraically closed field in terms of the dimensions of their commutative subalgebras. As a result, we also compute a similar function for complex nilpotent Lie groups of class 2.     

Avoiding abelian squares in partial words

Erd?s raised the question whether there exist infinite abelian square-free words over a given alphabet, that is, words in which no two adjacent subwords are permutations of each other. It can easily be checked that no such word exists over a three-letter alphabet. However, infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investigate the problem of avoiding abelian squares in partial words, or sequences that may contain some holes. In particular, we give lower and upper bounds for the number of letters needed to construct infinite abelian square-free partial words with finitely or infinitely many holes. Several of our constructions are based on iterating morphisms. In the case of one hole, we prove that the minimal alphabet size is four, while in the case of more than one hole, we prove that it is five. We also investigate the number of partial words of length n with a fixed number of holes over a five-letter alphabet that avoid abelian squares and show that this number grows exponentially with n.     

Biembedding Abelian groups with mates having transversals

A certain recursive construction for biembeddings of Latin squares has played a substantial role in generating large numbers of nonisomorphic triangular embeddings of complete graphs. In this article, we prove that, except for the groups and C ₄ , each Latin square formed from the Cayley table of an Abelian group appears in a biembedding in which the second Latin square has a transversal. Such biembeddings may then be freely used as ingredients in the recursive construction. Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 20:81‐88, 2012